Forbidden configurations and Steiner designs
نویسنده
چکیده
Let F be a (0, 1) matrix. A (0, 1) matrix M is said to have F as a configuration if there is a submatrix of M which is a row and column permutation of F . We say that a matrix M is simple if it has no repeated columns. For a given v ∈ N, we shall denote by forb(v,F) the maximum number of columns in a simple (0, 1) matrix with v rows for which F does not occur as a configuration. We say that a matrix M is maximal for F if M has forb(v,F) columns. In this paper we show that for certain natural choices of F , forb(v,F) ≤ ( v t) t+1 . In particular this gives an extremal characterization for Steiner t-designs as maximal (0, 1) matrices in terms of certain forbidden configurations.
منابع مشابه
Characterization of affine Steiner triple systems and Hall triple systems
It is known that a Steiner triple system is projective if and only if it does not contain the four-triple configuration C14. We find three configurations such that a Steiner Electronic Notes in Discrete Mathematics 29 (2007) 17–21 1571-0653/$ – see front matter © 2007 Elsevier B.V. All rights reserved. www.elsevier.com/locate/endm doi:10.1016/j.endm.2007.07.004 triple system is affine if and on...
متن کاملConfigurations in Steiner triple systems
" Combinatorial Designs and their Applications " c 1999 (copyright owner as specified in the book).
متن کاملWell Balanced Designs for Data Placement
The problem we consider in this article is motivated by data placement in particular data replication in video on demand systems. We are given a set V of n servers and b files (data, documents). Each file is replicated on exactly k servers. The problem is to determine the placement that minimizes the variance of the number of unavailable datas. To do that, we consider the problem of determining...
متن کاملOn the existence of block-transitive combinatorial designs
Block-transitive Steiner t-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and cryptography. The main result of the paper settles an important open question: There exist no non-trivial examples with t = 7 (or larger). The proof is bas...
متن کاملThe Steiner triple systems of order 19
Using an orderly algorithm, the Steiner triple systems of order 19 are classified; there are 11,084,874,829 pairwise nonisomorphic such designs. For each design, the order of its automorphism group and the number of Pasch configurations it contains are recorded; 2,591 of the designs are anti-Pasch. There are three main parts of the classification: constructing an initial set of blocks, the seed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 65 شماره
صفحات -
تاریخ انتشار 2012